Rook numbers and the normal ordering problem
نویسندگان
چکیده
منابع مشابه
Rook numbers and the normal ordering problem
Abstract. For an element w in the Weyl algebra generated by D and U with relation DU = UD + 1, the normally ordered form is w = ∑ ci,jU D . We demonstrate that the normal order coefficients ci,j of a word w are rook numbers on a Ferrers board. We use this interpretation to give a new proof of the rook factorization theorem, which we use to provide an explicit formula for the coefficients ci,j ....
متن کاملElliptic Rook and File Numbers
Utilizing elliptic weights, we construct an elliptic analogue of rook numbers for Ferrers boards. Our elliptic rook numbers generalize Garsia and Remmel’s q-rook numbers by two additional independent parameters a and b, and a nome p. The elliptic rook numbers are shown to satisfy an elliptic extension of a factorization theorem which in the classical case was established by Goldman, Joichi and ...
متن کاملApproximate substitutions and the normal ordering problem
In this paper, we show that the infinite generalised Stirling matrices associated with boson strings with one annihilation operator are projective limits of approximate substitutions, the latter being characterised by a finite set of algebraic equations. 1. Introduction The series of papers [1, 2, 3] had two sequels. First one, algebraic, was the construction of a Hopf algebra of Feynman-Bender...
متن کاملCombinatorial approach to generalized Bell and Stirling numbers and boson normal ordering problem
We consider the numbers arising in the problem of normal ordering of expressions in boson creation a† and annihilation a operators a ,a† =1 . We treat a general form of a boson string a† rnasn . . . a† r2as2 a† r1as1 which is shown to be associated with generalizations of Stirling and Bell numbers. The recurrence relations and closed-form expressions Dobiński-type formulas are obtained for thes...
متن کاملMonomiality principle, Sheffer-type polynomials and the normal ordering problem
We solve the boson normal ordering problem for ( q(a†)a+ v(a†) )n with arbitrary functions q(x) and v(x) and integer n, where a and a† are boson annihilation and creation operators, satisfying [a, a†] = 1. This consequently provides the solution for the exponential e †)a+v(a†)) generalizing the shift operator. In the course of these considerations we define and explore the monomiality principle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2005
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2005.07.012